Enumerating cliques in direct product graphs

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Independence in Direct-Product Graphs

Let α(G) denote the independence number of a graph G and let G ×H be the direct product of graphs G and H. Set α(G ×H) = max{α(G) · |H|, α(H) · |G|}. If G is a path or a cycle and H is a path or a cycle then α(G×H) = α(G×H). Moreover, this equality holds also in the case when G is a bipartite graph with a perfect matching and H is a traceable graph. However, for any graph G with at least one ed...

متن کامل

An Efficient Algorithm for Enumerating Pseudo Cliques

The problem of finding dense structures in a given graph is quite basic in informatics including data mining and data engineering. Clique is a popular model to represent dense structures, and widely used because of its simplicity and ease in handling. Pseudo cliques are natural extension of cliques which are subgraphs obtained by removing small number of edges from cliques. We here define a pse...

متن کامل

Identifying codes of the direct product of two cliques

An identifying code in a graph is a dominating set that also has the property that the closed neighborhood of each vertex in the graph has a distinct intersection with the set. The minimum cardinality of an identifying code in a graph G is denoted γID(G). It was recently shown by Gravier, Moncel and Semri that γ(Kn Kn) = ⌊ 3n 2 ⌋. Letting n,m ≥ 2 be any integers, we consider identifying codes o...

متن کامل

Cliques in random graphs

1. Introduction. Let 0 < p < 1 be fixed and denote by G a random graph with point set N, the set of natural numbers, such that each edge occurs with probability p, independently of all other edges. In other words the random variables ei5 , 1 < i < j, defined by _ 1 if (i, j) is an edge of G, et '-0 if (i, j) is not an edge of G, are independent r .v.'s with P(e i, = 1) = p, P(eij = 0) = 1-p. De...

متن کامل

Dominating cliques in graphs

A set of vertices is a dominating set in a graph if every vertex not in the dominating set is adjacent to one or more vertices in the dominating set. A dominating clique is a dominating set that induces a complete subgraph. Forbidden subgraph conditions sufficient to imply the existence of a dominating clique are given. For certain classes of graphs, a polynomial algorithm is given for finding ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorics

سال: 2020

ISSN: 2156-3527,2150-959X

DOI: 10.4310/joc.2020.v11.n2.a6